Computer science, computer, computational complexity

3.5 Computer Science Computational Mathematics and Geometry

Two teams, Computational Mathematics and Geometry, and Computational Environment, address research in Computer Science. Work in computational mathematics and geometry focuses on the areas of linear solvers, mesh generation and refinement, and interpolation between diverse discretizations. The target of our computational environment program is to provide the broad computational infrastructure ne...

Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity

A solution to get the problem off, have you found it? Really? What kind of solution do you resolve the problem? From what sources? Well, there are so many questions that we utter every day. No matter how you will get the solution, it will mean better. You can take the reference from some books. And the handbook of theoretical computer science vol a algorithms and complexity is one book that we ...

Theoretical Computer Science Elsevier Complexity in Left-associative Grammar

This paper presents a mathematical deenition of Left-Associative Grammar , and describes its formal properties. 1 Conceptually, LA-grammar is based on the notion of possible continuations, in contrast to more traditional systems such as Phrase Structure Grammar and Categorial Grammar , which are linguistically motivated in terms of possible substitutions. It is shown that LA-grammar generates a...

Department of Computer Science Lectures on Network Complexity

Lattices in Computer Science Lecture 5 Some basic complexity results

Recall that in the closest vector problem we are given a lattice and a target vector (which is usually not in the lattice) and we are supposed to find the lattice point that is closest to the target point. More precisely, one can consider three variants of the CVP, depending on whether we have to actually find the closest vector, find its distance, or only decide if it is closer than some given...